Choosability of K5-minor-free graphs
نویسندگان
چکیده
منابع مشابه
Choosability of Squares of K4-minor Free Graphs
Lih, Wang and Zhu [Discrete Math. 269 (2003), 303–309] proved that the chromatic number of the square of a K4-minor free graph with maximum degree ∆ is bounded by ⌊3∆/2⌋+1 if ∆ ≥ 4, and is at most ∆+3 for ∆ ∈ {2, 3}. We show that the same bounds hold for the list chromatic number of squares of K4-minor free graphs. The same result was also proved independently by Hetherington and Woodall.
متن کاملHomomorphisms of triangle-free graphs without a K5-minor
In the course of extending Grötzsch’s theorem, we prove that every triangle-free graph without a K5-minor is 3-colorable. It has been recently proved that every triangle-free planar graph admits a homomorphism to the Clebsch graph. We also extend this result to the class of triangle-free graphs without a K5-minor. This is related to some conjectures which generalize the Four-Color Theorem. Whil...
متن کاملExponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs
We present a fixed parameter algorithm that constructively solves the k-dominating set problem on graphs excluding one of the K5 or K3,3 as a minor in time O(3 6 √ n). In fact, we present our algorithm for any H-minor-free graph where H is a single-crossing graph (can be drawn on the plane with at most one crossing) and obtain the algorithm for K3,3(K5)-minor-free graphs as a special case. As a...
متن کاملFast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
As the class of graphs of bounded treewidth is of limited size, we need to solve NP-hard problems for wider classes of graphs than this class. Eppstein introduced a new concept which can be considered as a generalization of bounded treewidth. A graph G has locally bounded treewidth if for each vertex v of G, the treewidth of the subgraph of G induced on all vertices of distance at most r from v...
متن کاملChoosability of P5-Free Graphs
A graph is k-choosable if it admits a proper coloring of its vertices for every assignment of k (possibly different) allowed colors to choose from for each vertex. It is NP-hard to decide whether a given graph is k-choosable for k ≥ 3, and this problem is considered strictly harder than the k-coloring problem. Only few positive results are known on input graphs with a given structure. Here, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00158-7